package 路径问题;

public class test2 {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        // 数字为1就是有障碍,有障碍那么到这一格的路径为0
        int m = obstacleGrid.length; // 行
        int n = obstacleGrid[0].length; // 列
        int[][] dp = new int[m+1][n+1];
        dp[1][0] = 1;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (obstacleGrid[i-1][j-1]==0)
                    dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }

        return dp[m][n];
    }
}
